Informational Properties of the Nash Solutions of Two Stochastic Nonzero-Sum Games*

Within the framework of stochastic two-person nonzero-sum games, we deal with two commonly used models in engineering and economics-namely, the LQG (Linear-Quadratic-Gaussian) and the duopoly problems. We investigate how variations in information available to either player affect the equilibrium Nash strategies for these two models, whose existence and uniqueness have been proven in the paper. We show that for the LQG model better information for either player results in lower average Nash costs for both players; whereas for the duopoly model better information for one player helps him alone to achieve a higher average Nash profit, and it hurts the other player in the sense that his average Nash profit decreases. We further relate these properties of the Nash solutions for these two games to some of the distinct features of zero-sum games and team problems.